Counting connected graphs asymptotically
نویسندگان
چکیده
We find the asymptotic number of connected graphs with k vertices and k − 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the probabilistic method, analyzing breadth-first search on the random graph G(k, p) for an appropriate edge probability p. Central is analysis of a random walk with fixed beginning and end which is tilted to the left.
منابع مشابه
Asymptotic Enumeration and Limit Laws of Planar Graphs
A graph is planar if it can be embedded in the plane, or in the sphere, so that no two edges cross at an interior point. A planar graph together with a particular embedding is called a map. There is a rich theory of counting maps, started by Tutte in the 1960’s. However, in this paper we are interested in counting graphs as combinatorial objects, regardless of how many nonequivalent topological...
متن کاملEnumeration problems for classes of self-similar graphs
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of recurrences and provide methods to solve these recurrences asymptotically. This is shown for different examples involving classical self-similar graphs such as the Sierpiński graphs. The enumeration problems we investiga...
متن کاملApproximate Counting of Graphical Models via MCMC Revisited
In 2007, we applied MCMC to approximately calculate the ratio of essential graphs (EGs) to directed acyclic graphs (DAGs) for up to 20 nodes. In the present paper, we extend our previous work from 20 to 31 nodes. We also extend our previous work by computing the approximate ratio of connected EGs to connected DAGs, of connected EGs to EGs, and of connected DAGs to DAGs. Furthermore, we prove th...
متن کاملInversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs
Algebraic inversion of cycle index sum relations is employed to derive new algorithms for counting unlabeled graphs which are (a) 2-connected, (b) 2-connected and homeomorphically irreducible, and (c) 3-connected. The new algorithms are signiicantly more eecient than earlier ones, both asymptotically and for modest values of the order. Time-and space-complexity analyses of the algorithms are pr...
متن کاملA Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components
Tutte has described in the book “Connectivity in graphs” a canonical decomposition of any graph into 3-connected components. In this article we translate (using the language of symbolic combinatorics) Tutte’s decomposition into a general grammar expressing any family G of graphs (with some stability conditions) in terms of the subfamily G3 of graphs in G that are 3-connected (until now, such a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 27 شماره
صفحات -
تاریخ انتشار 2006